Dynamization of decomposable searching problems
نویسندگان
چکیده
منابع مشابه
Dynamization of Decomposable Searching Problems
In the complexity theory of geometric configurations (and other areas of algorithmic endeavor) one encounters a fair number of problems for which a very efficient static solution is known, but no alternative to complete reconstruction seems to come to mind when we wish to insert or delete even a single point. Bentley [1 3 recognized a large class of problems (which he called decomposable search...
متن کاملDecomposable Searching Problems
In this paper we will investigate transformations that serve as tools in the design of new data structures. Specifically, we study general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches). We will exhibit three classes of such transformations, each b...
متن کاملDecomposable Searching Problems I: Static-to-Dynamic Transformation
Transformations that serve as tools in the design of new data structures are investigated. Specifically, general methods for converting static structures (m which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches) are studied. Three classes of such transformations are exhibited, each based on a differe...
متن کاملFurther Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
In a generalized intersection searching problem, a set, S, of colored geometrie objects is to be preprocessed so that given some query object, q, the distinct colors of the objects intersected by q can be reported efficiently or the number of such colors can be counted effi.ciently. In the dynamic setting, colored objects can be inserted into or de1eted from S. These problems generalize the wel...
متن کاملHulls and Order Decomposable Problems
In this paper we consider dynamic data structures for Order Decomposable Problems. This dass of Problems indude the Convex Hull Problem, the Voronoi Diagram Problem, the Maxima Problem and the Intersection of Half Spaces. This paper first describes a scheme for maintaining convex hulls in the plane dynamically in O(logn) amortized time for insert ions and O(log2n ) time for deletions. O(n) spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1980
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(80)90073-3